On the Connection Between Deutsch-Jozsa Algorithm and Bent Functions

A different Deutsch-Jozsa

Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits

We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the onequbit Deutsch-Jozsa algorithm we show how the N-qubit version of the Bernstein-Vazirani algorithm can be realized. For the implementation of the three-qubit Deutsch-Jozsa algorithm we study in de...

A Generalization of the Deutsch-jozsa Quantum Algorithm

A quantum algorithm is presented that can be used to distinguish between certain classes of functions on a finite abelian group. The algorithm is patterned after and generalizes one due to Deutsch and Jozsa for distinguishing a constant function from a balanced function on a direct sum of copies of the integers modulo two. The Deutsch-Jozsa algorithm is a quantum algorithm for distinguishing be...

Two-bit Deutsch-Jozsa algorithm using an atomic ensemble

The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A 493, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of atoms and degenerate sources of photons. The photons interact dispersively with an atomic ensemble, leading to an effective Hamiltonian in atom-field basis, which is u...

3 Quantum Guessing via Deutsch - Jozsa

We examine the “Guessing Secrets” problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN3) steps to produce the answer. In showing the possibilities of ...